Coordination via Interaction Constraints I: Local Logic
نویسندگان
چکیده
منابع مشابه
Coordination via Interaction Constraints I: Local Logic
Wegner describes coordination as constrained interaction. We take this approach literally and define a coordination model based on interaction constraints and partial, iterative and interactive constraint satisfaction. Our model captures behaviour described in terms of synchronisation and data flow constraints, plus various modes of interaction with the outside world provided by external constr...
متن کاملImitation, Local Interaction, and Coordination: Part I
This paper analyzes players’ long run behavior in evolutionary coordination games with local interaction and imitation. Players are assumed to interact only with their neighbors, and to imitate the successful actions taken by their neighbors or themselves. It is found that the payoff-dominant equilibrium could prevail in the long run. We also derive the conditions under which both risk–dominant...
متن کاملLearning, Local Interaction, and Coordination
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملImitation, local interaction, and coordination
This paper analyzes players’ long run behavior in evolutionary coordination games with one-dimensional local interaction and imitation. Different from Alós-Ferrer and Weidenholzer’s study (JET, 2008), players in our model are assumed to extract valuable information from their interaction neighbors only. It is found that the payoff-dominant equilibrium could survive in the long run with a positi...
متن کاملLocal-Search Techniques for Propositional Logic Extended with Cardinality Constraints
We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardinalities of sets. Adding cardi-nality atoms to the language of propositional logic facilitates modeling search problems and often results in concise encodings. We propose two " native " local-search solvers for theorie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.12.2